On connectivity of basis graph of splitting matroids
نویسندگان
چکیده
منابع مشابه
dynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولConnectivity Properties of Matroids
The bases-exchange graph of a matroid is the graph whose vertices are the bases of the matroid, and two bases are connected by an edge if and only if one can be obtained from the other by the exchange of a single pair of elements. In this paper we prove that a matroid is \connected" if and only if the \restricted bases-exchange graph" (the bases-exchange graph restricted to exchanges involving ...
متن کاملGraphic splitting of cographic matroids
In this paper, we obtain a forbidden minor characterization of a cographic matroid M for which the splitting matroid Mx,y is graphic for every pair x, y of elements of M .
متن کاملeffect of oral presentation on development of l2 learners grammar
this experimental study has been conducted to test the effect of oral presentation on the development of l2 learners grammar. but this oral presentation is not merely a deductive instruction of grammatical points, in this presentation two hypotheses of krashen (input and low filter hypotheses), stevicks viewpoints on grammar explanation and correction and widdowsons opinion on limited use of l1...
15 صفحه اولOn the Szeged and Eccentric connectivity indices of non-commutative graph of finite groups
Let $G$ be a non-abelian group. The non-commuting graph $Gamma_G$ of $G$ is defined as the graph whose vertex set is the non-central elements of $G$ and two vertices are joined if and only if they do not commute.In this paper we study some properties of $Gamma_G$ and introduce $n$-regular $AC$-groups. Also we then obtain a formula for Szeged index of $Gamma_G$ in terms of $n$, $|Z(G)|$ and $|G|...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SN Applied Sciences
سال: 2019
ISSN: 2523-3963,2523-3971
DOI: 10.1007/s42452-019-0470-z